Domination Cover Pebbling Number for Even Cycle Lollipop

ثبت نشده
چکیده

The reaction of 1, 2-bis(diphenylphosphino)ethane monoxide, a hybrid ligand containing both soft (P) and hard (O) Lewis base centers in the same molecule, with organotin(IV) chloride and mercury(II) chloride has been carried out using dichloromethane as solvent. The products [HgCl2.(dppeO).R2SnCl2]n [R = Me (1), Ph (2) and CH2Ph (3)] have been obtained in excellent yields and are characterized using IR, 1H and 31P NMR spectroscopic methods. Based on the spectral data it is proposed that the structure may contain -Hg-P-O-Sn-O-PHgpolymeric array.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domination Cover Pebbling: Structural Results

This paper continues the results of “Domination Cover Pebbling: Graph Families.” An almost sharp bound for the domination cover pebbling (DCP) number, ψ(G), for graphs G with specified diameter has been computed. For graphs of diameter two, a bound for the ratio between λ(G), the cover pebbling number of G, and ψ(G) has been computed. A variant of domination cover pebbling, called subversion DC...

متن کامل

Domination Cover Pebbling: Graph Families

Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of domination cover pebbling, obtained by combining graph cover pebbling ([2]) with the theory of domination in graphs ([3]). The domination cover pebbling number, ψ(G)...

متن کامل

Cover Pebbling Cycles and Certain Graph Products

A pebbling step on a graph consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. A graph is said to be cover pebbled if every vertex has a pebble on it after a series of pebbling steps. The cover pebbling number of a graph is the minimum number of pebbles such that the graph can be cover pebbled, no matter how the pebbles are initially placed on the vert...

متن کامل

The Cover Pebbling Theorem

For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a cover pebbling starting with all pebbles on one node is trivial to compute and it was conjectured that the maximum of these simple cover pebbling numbers is...

متن کامل

The Complexity of Pebbling and Cover Pebbling

This paper discusses the complexity of graph pebbling, dealing with both traditional pebbling and the recently introduced game of cover pebbling. Determining whether a configuration is solvable according to either the traditional definition or the cover pebbling definition is shown to be NP -complete. The problem of determining the cover pebbling number for an arbitrary demand configuration is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016